An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan

This paper studies the bicriteria problem of scheduling n jobs on a parallel-batching machine to minimize maximum cost and makespan simultaneously. A is that can handle up b in batch. The batch start complete respectively at same time processing equal largest We consider unbounded case. For above problem, we present an O ( 3 )-time algorithm, which improved best known 4 complexity as special case lateness. Meanwhile, our algorithm also solve single-criterion ) time, algorithm.